Parametric Problems on Graphs of Bounded Tree-Width

We consider optimization problems on weighted graphs where vertex and edge weights are polynomial functions of a parameter . We show that, if a problem satis es certain regularity properties and the underlying graph has bounded tree-width, the number of changes in the optimum solution is polynomially bounded. We also show that the description of the sequence of optimum solutions can be constructed in polynomial time and that certain parametric search problems can be solved in O(n logn) time, where n is the number of vertices in the graph.